Private and rateless adaptive coded matrix-vector multiplication

نویسندگان

چکیده

Abstract Edge computing is emerging as a new paradigm to allow processing data near the edge of network, where typically generated and collected. This enables critical computations at in applications such Internet Things (IoT), which an increasing number devices (sensors, cameras, health monitoring devices, etc.) collect that needs be processed through computationally intensive algorithms with stringent reliability, security latency constraints. Our key tool theory coded computation, advocates mixing tasks by employing erasure codes offloading these other for computation. Coded computation recently gaining interest, thanks its higher smaller delay, lower communication costs. In this paper, we develop private rateless adaptive (PRAC) algorithm distributed matrix-vector multiplication taking into account (1) privacy requirements IoT (2) heterogeneous time-varying resources devices. We show PRAC outperforms known secure methods when are heterogeneous. provide theoretical guarantees on performance comparison baselines. Moreover, confirm our results simulations implementations Android-based smartphones.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coded Sparse Matrix Multiplication

In a large-scale and distributed matrix multiplication problem C = AB, where C ∈ Rr×t, the coded computation plays an important role to effectively deal with “stragglers” (distributed computations that may get delayed due to few slow or faulty processors). However, existing coded schemes could destroy the significant sparsity that exists in large-scale machine learning problems, and could resul...

متن کامل

SMAT: An Input Adaptive Sparse Matrix-Vector Multiplication Auto-Tuner

Sparse matrix vector multiplication (SpMV) is an important kernel in scientific and engineering applications. The previous optimizations are sparse matrix format specific and expose the choice of the best format to application programmers. In this work we develop an auto-tuning framework to bridge gap between the specific optimized kernels and their general-purpose use. We propose an SpMV autot...

متن کامل

GPU accelerated sparse matrix-vector multiplication and sparse matrix-transpose vector multiplication

Many high performance computing applications require computing both sparse matrix-vector product (SMVP) and sparse matrix-transpose vector product (SMTVP) for better overall performance. Under such a circumstance, it is critical to maintain a similarly high throughput for these two computing patterns with the underlying sparse matrix encoded in a single storage format. The compressed sparse blo...

متن کامل

Fast QMC Matrix-Vector Multiplication

Quasi-Monte Carlo (QMC) rules 1/N ∑N−1 n=0 f(ynA) can be used to approximate integrals of the form ∫ [0,1]s f(yA) dy, where A is a matrix and y is row vector. This type of integral arises for example from the simulation of a normal distribution with a general covariance matrix, from the approximation of the expectation value of solutions of PDEs with random coefficients, or from applications fr...

متن کامل

Faster Online Matrix-Vector Multiplication

We consider the Online Boolean Matrix-Vector Multiplication (OMV) problem studied by Henzinger et al. [STOC’15]: given an n× n Boolean matrix M, we receive n Boolean vectors v1, . . . ,vn one at a time, and are required to output Mvi (over the Boolean semiring) before seeing the vector vi+1, for all i. Previous known algorithms for this problem are combinatorial, running in O(n3/ log2 n) time. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Eurasip Journal on Wireless Communications and Networking

سال: 2021

ISSN: ['1687-1499', '1687-1472']

DOI: https://doi.org/10.1186/s13638-020-01887-y